Search results for "secret sharing"
showing 10 items of 21 documents
Rings for Privacy: an Architecture for Large Scale Privacy-Preserving Data Mining
2021
This article proposes a new architecture for privacy-preserving data mining based on Multi Party Computation (MPC) and secure sums. While traditional MPC approaches rely on a small number of aggregation peers replacing a centralized trusted entity, the current study puts forth a distributed solution that involves all data sources in the aggregation process, with the help of a single server for storing intermediate results. A large-scale scenario is examined and the possibility that data become inaccessible during the aggregation process is considered, a possibility that traditional schemes often neglect. Here, it is explicitly examined, as it might be provoked by intermittent network connec…
Experimental evaluation of privacy-preserving aggregation schemes on planetlab
2015
New pervasive technologies often reveal many sen- sitive information about users’ habits, seriously compromising the privacy and sometimes even the personal security of people. To cope with this problem, researchers have developed the idea of privacy-preserving data mining which refers to the possibility of releasing aggregate information about the data provided by multiple users, without any information leakage about individual data. These techniques have different privacy levels and communication costs, but all of them can suffer when some users’ data becomes inaccessible during the operation of the privacy preserving protocols. It is thus interesting to validate the applicability of such…
MSS: A Multi-Level Data Placement Scheme for Data Survival in Wireless Sensor Networks
2009
In recently popularized unattended wireless sensor networks, sensed data are stored locally or some designated nodes for a long term and retrieved sometime by collectors on demand. Such data may be delete or modified as sensor nodes are always exposed to risks such as random failure and mobile adversary. To maximize the data survival, we propose a secure and efficient scheme - MSS. MSS makes use of hopbounded computational secret sharing to achieve fault tolerance and compromise resilience, and takes advantages of multi-level secret sharing to mitigate communication overhead and improve overall security. MSS has the most advantages in terms of security and efficiency among presented schemes…
Metric regularity and subdifferential calculus in Banach spaces
1995
In this paper we give verifiable conditions in terms of limiting Frechet subdifferentials ensuring the metric regularity of a multivalued functionF(x)=−g(x)+D. We apply our results to the study of the limiting Frechet subdifferential of a composite function defined on a Banach space.
HybridS: A Scheme for Secure Distributed Data Storage in WSNs
2008
In unattended wireless sensor networks (WSNs), data is stored locally or at designated nodes upon sensing, and users can access it on demand. This paradigm can improve energy efficiency by making use of the upcoming cheap and large flash memory, as well as system robustness. Nevertheless, the security and dependability of distributed storage are critical for the applicability of such WSNs. In this paper, we propose a secure and dependable data storage scheme by taking advantages of secret sharing and Reed-Solomon code, which has computational security and yet maintains optimal data size. The extensive analysis verifies our scheme can provide secure and dependable data storage in WSNs in the…
Weight Adaptation Stability of Linear and Higher-Order Neural Units for Prediction Applications
2018
This paper is focused on weight adaptation stability analysis of static and dynamic neural units for prediction applications. The aim of this paper is to provide verifiable conditions in which the weight system is stable during sample-by-sample adaptation. The paper presents a novel approach toward stability of linear and higher-order neural units. A study of utilization of linear and higher-order neural units with the foundations on stability of the gradient descent algorithm for static and dynamic models is addressed.
On the social value of publicly disclosed information and environmental regulation
2018
Abstract This paper presents an analysis of environmental policy in imperfectly competitive market with publicly disclosed and privately-held information about costs. We examine the potential asymmetry-reducing role of disclosure and its impact on setting environmental taxes. From a policy perspective, our findings show that disclosure with verifiable reports, is a valuable public good, provides greater transparency in the market, and is generally efficiency enhancing. Results suggest that access to publicly disclosed information enables the fine-tuning of the tax rules towards specific environmental circumstances and improves the ability of the regulator to levy firm-specific environmental…
Finite state verifiers with constant randomness
2014
We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers. A corollary of our main result is that the class of outcome problems corresponding to O(log n)-space …
H2S: A Secure and Efficient Data Aggregative Retrieval Scheme in Unattended Wireless Sensor Networks
2009
In unattended wireless sensor networks, data are stored locally and retrieved on demand. To efficiently transmit the collector’s retrieval results, data are aggregated along being forwarded. The data confidentiality and integrity should be protected at the intermediate nodes. End-to-end encryption or hop-by-hop encryption based schemes are not efficient. Straightforward homomorphic encryption based scheme is not compromise resilient. To achieve all the desires, we propose a scheme - H2S by making use of both homomorphic secret sharing and homomorphic encryption. The security and efficiency of our scheme are justified by extensive analysis.
A distributed data storage and retrieval scheme in unattended WSNs using Homomorphic Encryption and secret sharing
2009
Many data storage schemes have been proposed in the past for keeping dependable data storage, but they are not designed for Unattended Wireless Sensor Networks (UWSNs). When applying these schemes to UWSNs, most of them have limitations such as high storage requirement, transmission cost, and not resilient to a large number of node compromises. To address the problem of data storage, transmission cost, and resilience of node compromise in UWSNs, we propose a novel Homomorphic Encryption and Homomorphic Secret Sharing based scheme (HEHSS) to accomplish the goals of confidentiality, resilience to node compromises, reliability, and efficiency of storage and transmission. Our scheme exploits th…